Maximizing Fun by Creating Data with Easily Reducible Subjective Complexity

نویسندگان

  • Jürgen Schmidhuber
  • J. Schmidhuber
چکیده

The Formal Theory of Fun and Creativity (1990–2010) [Schmidhuber, J.: Formal theory of creativity, fun, and intrinsic motivation (1990–2010). IEEE Trans. Auton. Mental Dev. 2(3), 230–247 (2010b)] describes principles of a curious and creative agent that never stops generating nontrivial and novel and surprising tasks and data. Two modules are needed: a data encoder and a data creator. The former encodes the growing history of sensory data as the agent is interacting with its environment; the latter executes actions shaping the history. Both learn. The encoder continually tries to encode the created data more efficiently, by discovering new regularities in it. Its learning progress is the wow-effect or fun or intrinsic reward of the creator, which maximizes future expected reward, being motivated to invent skills leading to interesting data that the encoder does not yet know but can easily learn with little computational effort. I have argued that this simple formal principle explains science and art and music and humor. Note: This overview heavily draws on previous publications since 1990, especially Schmidhuber (2010b), parts of which are reprinted with friendly permission by IEEE.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Subcarrier Assignment and Power Distribution in Multiuser OFDM Systems with Proportional Data Rate Requirement

A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...

متن کامل

Combining Self-reducibility and Partial Information Algorithms

A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, approximable, and easily countable languages are defined by the existence of polynomial-time partial information algorithms of specific type. Self-reducible languages, for different types of self-reductions, form subcla...

متن کامل

On Self-Reducible Sets of Low Information Content

Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this self-reducibility structure of a set can be used to access easily all information contained in the set, if its information content is small. It is shown that P c...

متن کامل

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...

متن کامل

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).&#10In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013